Schematic Finite-State Intersection Parsing
نویسنده
چکیده
The framework of Finite-State Intersection Grammars employs a parsing technique according to which several finite-state automata are intersected to determine the output automaton. Implementation of the intersection parser has turned out to be a difficult task. Several problems in efficiency arise when disambiguation choices are based on long contexts with many don’t cares. We are concerned with the long-distance effects of the grammatical constraints. We outline a compacting method that rearranges the search space of the intersection process and makes it shallower. This method is based on the specialization of grammar rules relative to each input sentence.
منابع مشابه
The Intersection of Finite State Automata and Definite Clause Grammars
Bernard Lang defines parsing as the calculation of the intersection of a FSA (the input) and a CFG. Viewing the input for parsing as a FSA rather than as a string combines well with some approaches in speech understanding systems, in which parsing takes a word lattice as input (rather than a word string). Furthermore, certain techniques for robust parsing can be modelled as finite state transdu...
متن کاملA Practical Algorithm for Intersecting Weighted Context-free Grammars with Finite-State Automata
It is well known that context-free parsing can be seen as the intersection of a contextfree language with a regular language (or, equivalently, the intersection of a context-free grammar with a finite-state automaton). The present article provides a practical efficient way to compute this intersection by converting the grammar into a special finite-state automaton (the GLR(0)-automaton) which i...
متن کاملOn the Intersection of Finite State Automata and De nite Clause Grammars
An elegant framework for robust parsing was presented by Bernard Lang on last year's TWLT. In Lang's approach parsing is viewed as the calculation of the intersection of a FSA (the input) and a CFG. Viewing the input for parsing as a FSA rather than as a string combines well with standard approaches in speech understanding systems in which typically a word lattice is produced as an intermediate...
متن کاملFinite-State Parsing And Disambiguation
A languageindependent method of finitestate surface syntactic parsing and word-disambiguation is discussed. Input sentences are represented as finite-state networks already containing all possible roles and interpretations of its units. Also syntactic constraint rules are represented as finite-state machines where each constraint excludes certain types of ungrammatical readings. The whole gramm...
متن کاملRegular Approximation of Link Grammar
We present a regular approximation of Link Grammar, a dependency-type formalism with context-free expressive power, as a first step toward a finite-state joint inference system. The approximation is implemented by limiting the maximum nesting depth of links, and otherwise retains the features of the original formalism. We present a string encoding of Link Grammar parses and describe finite-stat...
متن کامل